منابع مشابه
Channel Capacity of Equal Matrix Languages
where f l , are in V~ Equal matrix languages (abbreviated E M L ) have the interesting property that the corresponding Parikh mappings are semilinear (Siromoney, 1969a, 1969b). Further, every equal matrix grammar (abbreviated E M G ) is nonterminal bounded in the sense that in any line of a derivation the total number of nonterminals is less than a constant. This concept of nonterminal boundedn...
متن کاملSimple Matrix Languages
It is shown that £t(1)[~(l)] coincides with the class of context-free languages [regular sets] and that ~9' is a proper subset of the family of languages accepted by deterministic linear bounded automata, It is proved that ~(n)[~(n)] forms a hierarchy of classes of languages in ~9°[~]. The closure properties and decision problems associated with ,9°(n), ,.9", ,~(n), and ~ are thoroughly investi...
متن کاملA Homomorphic Representation of Simple Matrix Languages
In this paper we continue the investigation of simple matrix languages introduced by Ibarra (1970) as a subfamily of matrix languages. Simple matrix languages have many properties similar to those of context-free languages. In the following, we prove that every simple matrix language can be written as a homomorphic image of the intersection of the Dyck context-free language and an equal matrix ...
متن کاملCodifiable Languages and the Parikh Matrix Mapping
We introduce a couple of families of codifiable languages and investigate properties of these families as well as interrelationships between different families. Also we develop an algorithm based on the Earley algorithm to compute the values of the inverse of the Parikh matrix mapping over a codifiable context-free language. Finally, an attributed grammar that computes the values of the Parikh ...
متن کاملLearning Equal Matrix Grammers and Multitape Automata with Structural Information
Equal matrix grammars are one of paralel rewriting systems. This type of parallel rewriting systems has been investigated in several areas such as L-systems and the syntactic pattern recognition. In this paper, we introduce two types of structural information and show that if these are available and there is a method of learning regular sets in polynomial time, then for any positive integer $k$...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information and Control
سال: 1969
ISSN: 0019-9958
DOI: 10.1016/s0019-9958(69)90050-3